III 5 - 6 September 2005 Department of Computer Science University of Sheffield
نویسندگان
چکیده
Branch testing, for example, seeks to cover all branches in a piece of code, but when it is performed, as well as branches, other program elements, such as statements or puses, will necessarily be covered. The contemporaneous coverage of these other elements is referred to as “collateral coverage”. An understanding of the extent of the collateral coverage of the various program elements that is afforded by the available testing methods, can be used to determine an optimal deployment of the methods in pursuance of the aim of covering one or more of those elements. In this paper, as a step towards such an understanding, the collateral coverage that branch testing yields in respect of JJ-paths, and that JJ-testing yields in respect of branches, is investigated. The results of the investigation do, in fact, facilitate the definition of a policy for deploying the two methods when branch coverage, JJ-path coverage, and/or both of these is sought. However perhaps surprisingly, they also indicate that the widespread preference for branch over JJ-path testing, may not be justified.
منابع مشابه
Session Track 2011 Overview ∗
This overview is organized as follows: in Section 2 we describe the tasks participants were to perform. In Section 3 we describe the corpus, topics, and sessions that comprise the test collection. Section 4 gives some information about submitted runs. In Section 5 we describe relevance judging and evaluation measures, and Sections 6 and 7 present evaluation results and analysis. We conclude in ...
متن کاملLMI based stability analysis and robust controller design for discrete linear repetitive processes
1 Institute of Control and Computation Engineering, University of Zielona Gora, Poland Dept. of Mechanical Engineering, University of Hong Kong Department of Electronics and Computer Science, University of Southampton, Southampton SO 17 1BK, U.K. Department of Automation, Nanjing University of Science and Technology, Nanjing 210094, P.R. China Department of Automatic Control and Systems Enginee...
متن کاملGeneral Topologies and P Systems
1 Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University, Pázmány Péter st. 1/c, Budapest, 1117, Hungary [email protected] 2 Department of Computer Science, The University of Sheffield Regent Court, 211 Portobello, Sheffield S1 4DP, United Kingdom {M.Stannett, M.Gheorghe}@dcs.shef.ac.uk 3 Department of Computer Science, University of Piteşti Str Targu ...
متن کاملMultirobot Coverage Search in Three Dimensions
Christian Dornhege Department of Computer Science, University of Freiburg, 79110 Freiburg, Germany Alexander Kleiner iRobot Corp., 1055 E. Colorado Blvd., Suite 340, Pasadena, CA 91106, USA e-mail: [email protected] Andreas Hertle Department of Computer Science, University of Freiburg, 79110 Freiburg, Germany e-mail: [email protected] Andreas Kolling Department of Automatic Co...
متن کاملOptimal Control for a Class of Differential Linear Repetitive Processes
S. Dymkou, E. Rogers, M. Dymkov, K. Ga lkowski, D. H. Owens 1 ITMS, Ballarat University, Australia. 2 Department of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, UK. [email protected] 3 Institute of Mathematics, National Academy of Sciences of Belarus, Minsk, Belarus. 4 Institute of Control and Computation Engineering, University of Zielona Góra, Poland. ...
متن کامل